On the Pagenumber of Bipartite Orders
نویسندگان
چکیده
The pagenumber problem for ordered sets is known to be NP-complete, even if the order of the elements on the spine is fixed. In this paper, we investigate this problem for some classes of ordered sets. We provide an efficient algorithm for drawing bipartite interval orders in the minimum number of pages needed. We also give an upper bound for the pagenumber of general bipartite ordered sets and the pagenumber of the complete multipartite ordered sets with length four and five.
منابع مشابه
On The Book Embedding Of Ordered Sets
In the book embedding of an ordered set, the elements of the set are embedded along the spine of a book to form a linear extension. The pagenumber (or stack number) is the minimum number of pages needed to draw the edges as simple curves such that edges drawn on the same page do not intersect. The pagenumber problem for ordered sets is known to be NP-complete, even if the order of the elements ...
متن کاملOn Crossing Sets, Disjoint Sets and the Pagenumber 1
Let G = (V;E) be a t-partite graph with n vertices and m edges, where the partite sets are given. We present an O(n2m1:5) time algorithm to construct drawings of G in the plane so that the size of the largest set of pairwise crossing edges, and at the same time, the size of the largest set of disjoint (pairwise non-crossing) edges are O(pt m). As an application we embed G in a book of O(pt m) p...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملExtremal Graph Theory for Book-Embeddings
A book-embedding of a graph is a linear ordering of its vertices, and a partition of its edges into non-crossing sets (called pages). The pagenumber of a graph is the minimum number of pages for which it has a book-embedding. After introducing concepts relevant to book-embeddings and their applications, we will describe the main results on the pagenumber for classes of graphs, particularly resu...
متن کاملA Genetic Algorithm for Finding the Pagenumber of Interconnection Networks
A ‘‘book-embedding’’ of a graph G comprises embedding the graph’s nodes along the spine of a book and embedding the edges on the pages so that the edges embedded on the same page do not intersect. This is also referred to as the page model. The ‘‘pagenumber’’ of a graph is the thickness of the smallest (in number of pages) book into which G can be embedded. The problem has been studied only for...
متن کامل